Defining sets of extended cyclic codes invariant under the affine group
نویسنده
چکیده
We describe the defining sets of extended cyclic codes of length pn over a field and over the ring of integers modulo pe admitting the affine group AGLm(p ), n=mt , as a permutation group. © 2004 Elsevier B.V. All rights reserved. MSC: 94B05; 20B25; 94B15; 94B60
منابع مشابه
The Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields
Affine-invariant codes are extended cyclic codes of length pm invariant under the affine-group acting on Fpm . This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes [2], [5]. We derive here new results, especially when the alphabet field is an extension field, by expanding o...
متن کاملThe permutation group of affine-invariant extended cyclic codes
The extended cyclic codes of length p” , p a prime, which are invariant under the aff ine-group acting on ffpm, are called affine-invariant codes. Following recent results of Berger, we present the formal expression of the permutat ion group of these codes. Afterwards we give several tools in order to determine effectively the group of a given code or of some infinite class of codes. W e next p...
متن کاملThere Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length p is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or its dual. Affine-invariant codes were firstly introduced by Kasami, Lin and Peterson [KLP2] as a generalization of Reed-Muller codes. This class of codes has received the attention of several authors because of its good ...
متن کاملAll binary linear codes that are invariant under PSL2(n)
The projective special linear group PSL2(n) is 2-transitive for all primes n and 3-homogeneous for n≡ 3 (mod 4) on the set {0,1, · · · ,n−1,∞}. It is known that the extended odd-like quadratic residue codes are invariant under PSL2(n). Hence, the extended quadratic residue codes hold an infinite family of 2-designs for primes n≡ 1 (mod 4), an infinite family of 3-designs for primes n≡ 3 (mod 4)...
متن کاملOn Self-Dual Affine-Invariant Codes
An extended cyclic code of length 2 m over GF(2) cannot be self-dual for even m. For odd m, the Reed-Muller code [2 m, 2 m1, 2(m + 1)/2] is affine-invariant and selfdual, and it is the only such code for m = 3 or 5. We describe the set of binary self-dual affine-invariant codes of length 2 m for m = 7 and m = 9. For each odd m, m >i 9, we exhibit a self-dual affine-invariant code of length 2 m ...
متن کامل